A vector quantization method for nearest neighbor classifier design
نویسندگان
چکیده
This paper proposes a nearest neighbor classifier design method based on vector quantization (VQ). By investigating the error distribution pattern of the training set, the VQ technique is applied to generate prototypes incrementally until the desired classification result is reached. Experimental results demonstrate the effectiveness of the method. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Prototype Based Classifier Design with Pruning
An algorithm is proposed to prune the prototype vectors (prototype selection) used in a nearest neighbor classifier so that a compact classifier can be obtained with similar or even better performance. The pruning procedure is error based; a prototype will be pruned if its deletion leads to the smallest classification error increase. Also each pruning iteration is followed by one epoch of Learn...
متن کاملFeature Selection for Classification by Using a Ga-based Neural Network Approach
This paper proposes a method of genetic algorithm (GA) based neural network for feature selection that retains sufficient information for classification purposes. This method combines a genetic algorithm with an artificial neural network classifier, such as back-propagation (BP) neural classifier, radial basis function (RBF) classifier or learning vector quantization (LVQ) classifier. In this a...
متن کاملAsymmetric learning vector quantization for efficient nearest neighbor classification in dynamic time warping spaces
The nearest neighbor method together with the dynamic time warping (DTW) distance is one of the most popular approaches in time series classification. This method suffers from high storage and computation requirements for large training sets. As a solution to both drawbacks, this article extends learning vector quantization (LVQ) from Euclidean spaces to DTW spaces. The proposed LVQ scheme uses...
متن کاملAn LVQ-based adaptive algorithm for learning from very small codebooks
The present paper introduces an adaptive algorithm for competitive training of a nearest neighbor (NN) classifier when using a very small codebook. The new learning rule is based on the well-known LVQ method, and uses an alternative neighborhood concept to estimate optimal locations of the codebook vectors. Experiments over synthetic and real databases suggest the advantages of the learning tec...
متن کاملLearning Better Encoding for Approximate Nearest Neighbor Search with Dictionary Annealing
We introduce a novel dictionary optimization method for high-dimensional vector quantization employed in approximate nearest neighbor (ANN) search. Vector quantization methods first seek a series of dictionaries, then approximate each vector by a sum of elements selected from these dictionaries. An optimal series of dictionaries should be mutually independent, and each dictionary should generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 25 شماره
صفحات -
تاریخ انتشار 2004